Escaping Depressions in LRTS Based on Incremental Refinement of Encoded Quad-Trees
نویسندگان
چکیده
منابع مشابه
Dynamic Mesh Refinement with Quad Trees and Off-Centers
Many algorithms exist for producing quality meshes when the input point cloud is known a priori. However, modern finite element simulations and graphics applications need to change the input set during the simulation dynamically. In this paper, we show a dynamic algorithm for building and maintaining a quadtree under insertions into and deletions from an input point set in any fixed dimension. ...
متن کاملEscaping heuristic depressions in real-time heuristic search
Heuristic depressions are local minima of heuristic functions. While visiting one them, real-time (RT) search algorithms like LRTA∗ will update the heuristic value for most of their states several times before escaping, resulting in costly solutions. Existing RT search algorithm tackle this problem by doing more search and/or lookahead but do not guide search towards leaving depressions. We pre...
متن کاملAvoiding and Escaping Depressions in Real-Time Heuristic Search
Heuristics used for solving hard real-time search problems have regions with depressions. Such regions are bounded areas of the search space in which the heuristic function is inaccurate compared to the actual cost to reach a solution. Early real-time search algorithms, like LRTA∗, easily become trapped in those regions since the heuristic values of their states may need to be updated multiple ...
متن کاملFFT-based incremental refinement of suboptimal detection
In the context of FFT-based maximum-likelihood (ML) detection of a complex sinusoid in noise, we consider the result of terminating the FFT at an intermediate stage of computation and applying the ML detection strategy to its unnnished results. We show that detection performance increases monotonically with the number of FFT stages completed , converging ultimately to that of the exact ML detec...
متن کاملstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2017
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2017/1850678